Dynamic stability of a curved rail under a moving load

The stability of a curved rail under a constant moving load has been investigated using a linear theory; critical speeds of the moving load, and the dynamic rail deflections and rotation were calculated. The effect of the foundation was included through distributed linear springs. It was assumed that the moving load remains in constant contact with the rail and travels along a fixed path on the rail head.     

Dynamic Behavior of Rigid–Plastic Sector Plates

The paper studies the dynamic behavior of perfect rigid-plastic plates in the form of a sector with hinged or clamped sides under short-term intensive loads. Two dynamic deformation mechanisms are demonstrated. The dynamic equation is derived for each of the mechanisms. The realization conditions for the mechanisms are analyzed. Analytical expressions are derived for the ultimate (high) loads and the maximum residual deflection. Numerical examples are given     

Single facility location problems with unbounded unit balls

In this paper we consider a new class of continuous location problems where the distances are measured by gauges of closed (not necessarily bounded) convex sets. These distance functions do not satisfy the definiteness property and therefore they can be used to model those situations where there exist zero-distance regions. We prove a geometrical characterization of these measures of distance as the length of shortest paths between points using only a subset of directions of their unit balls. We also characterize the complete set of optimal solutions for this class of continuous single facility location problems and we give resolution methods to solve them. Our analysis allows to consider new models of location problems and generalizes previously known results.     

基于元胞传输模型的可变信息标志选址问题研究

随着智能交通技术的发展，可变信息标志(VMS)被广泛应用于动态交通管理中.元胞传输模型(CTM)可以较好地模拟交通流激波、排队形成与消散等交通流动力学特性.应用CTM对VMS选址问题进行了研究.数值模拟结果表明，合适的VMS位置可以减少系统内所有车辆的行驶时间.还分析了路径选择概率变化与VMS位置之间的关系.在一定范围内，交通事故越严重，VMS应设置在距离事故地点越远的地方. 关键词： 可变信息标志 选址问题 元胞传输模型 数值模拟     

基于曲线拟合的亚像素边缘定位方法的研究

图像的边缘定位是图像测量的关键之一,随着测量精度要求的提高,已由早期的像素级边缘定位发展到了现在的亚像素级边缘定位。根据地球在地球敏感器CCD阵面中的成像特性,提出了一种基于曲线拟合的亚像素边缘定位方法以获取地球“灼热圆盘”的边缘。该方法利用曲线拟合获得的拟合斜率以及灰度值来提取图像的边缘。仿真结果表明,采用曲线拟合亚像素边缘定位法可使图像的边缘定位精度达到百分之几个像素,具有较高的精度。     

天文导航中星体高精度细分定位方法研究

介绍了一种从星体图像中高精度提取恒星位置的方法.这种方法把星光成像看成是高斯点扩散函数模型,利用线性内插和最小二乘法拟合得到高斯曲面参数,从高斯曲面模型中得到亚像素级的恒星位置.由于直接进行高斯曲面拟合计算非常复杂,将二维曲面拟合转化为两个方向上的一维曲线拟合,分别得到不同的曲面系数.仿真结果表明当信噪比小于0.05时,定位精度能达到1/20像素,与质心法比较,高斯曲面拟合法精度高,抗噪声能力强.     

一种复杂车辆图像中的多车牌定位方法

针对复杂背景中多个车牌的定位问题,提出一种新的定位方法.该方法综合利用边缘检测、连通域分析、倾斜矫正等多种方法,解决了复杂背景中定位难的问题.能够准确定位杂乱背景中的车牌,对天气、光照变化、车牌在图像中的移动和旋转等,具有良好的适应能力.该方法为后续的字符分割和字符识别提供旋转角度、字符区域定位信息.     

A computational approach for eliminating error in the solution of the location set covering problem

The location set covering problem continues to be an important and challenging spatial optimization problem. The range of practical planning applications underscores its importance, spanning fire station siting, warning siren positioning, security monitoring and nature reserve design, to name but a few. It is challenging on a number of fronts. First, it can be difficult to solve for medium to large size problem instances, which are often encountered in combination with geographic information systems (GIS) based analysis. Second, the need to cover a region efficiently often brings about complications associated with the abstraction of geographic space. Representation as points can lead to significant gaps in actual coverage, whereas representation as polygons can result in a substantial overestimate of facilities needed. Computational complexity along with spatial abstraction sensitivity combine to make advances in solving this problem much needed. To this end, a solution framework for ensuring complete coverage of a region with a minimum number of facilities is proposed that eliminates potential error. Applications to emergency warning siren and fire station siting are presented to demonstrate the effectiveness of the developed approach. The approach can be applied to convex, non-convex and non-contiguous regions and is unaffected by arbitrary initial spatial representations of space.     

Locating the two-median of a tree network with continuous link demands

Typical formulations of thep-median problem on a network assume discrete nodal demands. However, for many problems, demands are better represented by continuous functions along the links, in addition to nodal demands. For such problems, optimal server locations need not occur at nodes, so that algorithms of the kind developed for the discrete demand case can not be used. In this paper we show how the 2-median of a tree network with continuous link demands can be found using an algorithm based on sequential location and allocation. We show that the algorithm will converge to a local minimum and then present a procedure for finding the global minimum solution.     

A note on optimality conditions for the Euclidean. Multifacility location problem

Thekey problem of the Euclidean multifacility location (EMFL) problem is to decide whether a givendead point is optimal. If it is not optimal, we wish to compute a descent direction. This paper extends the optimality conditions of Calamai and Conn and Overton to the case when the rows of the active constraints matrix are linearly dependent. We show that linear dependence occurs wheneverG, the graph of the coinciding facilities, has a cycle. In this case the key problem is formulated as a linear least squares problem with bounds on the Euclidean norms of certain subvectors.